Adaptive age replacement

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonparametric adaptive opportunity-based age replacement strategies

We consider opportunity-based age replacement using nonparametric predictive inference (NPI) for the time to failure of a future unit. Based on n observed failure times, NPI provides lower and upper bounds for the survival function for the time to failure Xn+1 of a future unit, which lead to upper and lower cost functions, respectively, for opportunitybased age replacement based on the renewal ...

متن کامل

AGE REPLACEMENT POLICY IN UNCERTAIN ENVIRONMENT

Age replacement policy is concerned with finding an optional time tominimize the cost, at which time the unit is replaced even if itdoes not fail. So far, age replacement policy involving random agehas been proposed. This paper will assume the age of the unit is anuncertain variable, and find the optimal time to replace the unit.

متن کامل

Nonparametric adaptive age replacement with a one-cycle criterion

Age replacement of technical units has received much attention in the reliability literature over the last four decades. Mostly, the failure time distribution for the units is assumed to be known, and minimal costs per unit of time is used as optimality criterion, where renewal reward theory simplifies the mathematics involved but requires the assumption that the same process and replacement st...

متن کامل

age replacement policy in uncertain environment

age replacement policy is concerned with finding an optional time tominimize the cost, at which time the unit is replaced even if itdoes not fail. so far, age replacement policy involving random agehas been proposed. this paper will assume the age of the unit is anuncertain variable, and find the optimal time to replace the unit.

متن کامل

CAR: Clock with Adaptive Replacement

CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the accessed item to the most recently used position, at which point, to ensure consistency and correctness, it serializes cache hits behind a single global lock. CLOCK eliminates this lock contention, and, hence, can supp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1967

ISSN: 0022-247X

DOI: 10.1016/0022-247x(67)90064-9